Chain rules for nonsmooth functions
نویسندگان
چکیده
منابع مشابه
Do the chain rules for matrix functions hold without commutativity?
This paper shows that the commutativity condition [A(t), A′(t)] = 0 is often not necessary to guarantee the chain rules for matrix functions: d dtf(A(t)) = A ′(t)f ′(A(t)) and d dtf(A(t)) = f ′(A(t))A′(t), where A(t) is a square matrix of differentiable functions and f is an analytic function. A further question on the chain rules is presented and discussed.
متن کاملNonsmooth Control-Lyapunov Functions
It is shown that the existence of a continuous controlLyapunov function (CLF) is necessary and sufficient for null asymptotic controllability of nonlinear finitedimensional control systems. The CLF condition is expressed in terms of a concept of generalized derivative that has been studied in set-valued analysis and the theory of differential inclusions with various names such as “upper conting...
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملRisk Aversion for Nonsmooth Utility Functions
This paper generalizes the notion of risk aversion for functions which are not necessarily differentiable nor strictly concave. Using an approach based on superdifferentials, we define the notion of a risk aversion measure, from which the classical absolute as well as relative risk aversion follows as a RadonNikodym derivative if it exists. Using this notion, we are able to compare risk aversio...
متن کاملA quasisecant method for minimizing nonsmooth functions
In this paper a new algorithm to locally minimize nonsmooth, nonconvex functions is developed. We introduce the notion of secants and quasisecants for nonsmooth functions. The quasisecants are applied to find descent directions of locally Lipschitz functions. We design a minimization algorithm which uses quasisecants to find descent directions. We prove that this algorithm converges to Clarke s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1991
ISSN: 0022-247X
DOI: 10.1016/0022-247x(91)90254-w